Linear concurrent constraint programming : operational and phase
نویسندگان
چکیده
In this paper we settle a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in intuitionistic linear logic. We illustrate the usefulness of these results by showing with examples how the phase semantics of linear logic can be used to give simple \semantical" proofs of safety properties of LCC programs 1 .
منابع مشابه
Linear Concurrent Constraint Programming: Operational and Phase Semantics
In this paper we settle a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in intuitionistic linear logic. We illustrate the us...
متن کاملToward Observational Equivalences for Linear Logic Concurrent Constraint Languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملObservational equivalences for linear logic concurrent constraint languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملPartial Order and SOS Semantics for Linear Constraint Programs
In this paper we consider linear constraint programming (lcp), a non-monotonic extension of concurrent constraint programming (ccp) which allows to remove information. The entailment relation of a linear constraint system, in terms of which linear constraint programs are deened, is based on the main underlying idea of linear logic: hypotheses in a logical derivation represent physical resources...
متن کاملDesign and Implementation of a Concurrent Logic Programming Language with Linear Logic Constraints
Prolog is originally rooted in logic with the elegant mapping: “programs = formulas, execution = proof search”. Constraint logic programming extends Prolog to program in a richer structure than mere Herbrand terms. The underlying constraint solving engine requires either to be built-in or to add coroutines mechanisms that are not in the scope of logical reading. Implementations add other non-lo...
متن کامل